Mostly dead

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Know Thy Source Code. Is it mostly dead or alive?

Nowadays, even small systems contain numerous components with complex dependencies. These components differ in importance and quality. Some of them get deprecated over time and can be removed from the project. This leads to the question relevant for all architects: which parts of my source code are still alive? To answer this question we harness the graph-based model of software. We perform a d...

متن کامل

Mostly calibrated

Prequential testing of a forecaster is known to be manipulable if the test must pass an informed forecaster for all possible true distributions. Stewart (2011) provides a non-manipulable prequential likelihood test that only fails an informed forecaster on a small, category I, set of distributions. We present a prequential test based on calibration that also fails the informed forecaster on at ...

متن کامل

Book Review: Mostly Harmless

Radical as this claim may seem to a casual reader, the actual alternative that emerges from integrating Noë’s arguments with the state of the art in vision research is in fact rather tame, if not entirely mainstream (hence the title of my review). The main reason for this happy, if somewhat anticlimactic, conclusion is that the first part of Noë’s thesis—that perception cannot be fully internal...

متن کامل

Mostly Accurate Stack Scanning

The Java Virtual Machine (Jvm) needs, for the purpose of garbage collection (GC), to determine the data type stored in every memory location. Jvms that can do this reliably are said to be type-accurate (TA). Full typeaccuracy usually exacts a price in performance due to the need to scan stacks and registers accurately. The mostly accurate approach presented here can reduce the TA overhead signi...

متن کامل

Unguardedness mostly means many solutions

A widely accepted method to specify (possibly infinite) behaviour is to define it as the solution, in some process algebra, of a recursive specification, i.e., a system of recursive equations over the fundamental operations of the process algebra. The method only works if the recursive specification has a unique solution in the process algebra; it is well-known that guardedness is a sufficient ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature

سال: 2001

ISSN: 0028-0836,1476-4687

DOI: 10.1038/35084313